0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_vampire %s %d THM
0.12/0.33	% Computer : n003.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 04:16:34 EDT 2025
0.12/0.33	% CPUTime    : 
0.12/0.35	This is a THF_ problem
0.12/0.35	Running higher-order theorem proving
0.12/0.36	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.GNhDOeYHBy/E---3.1_31082.p -m 16384 -t 240
0.12/0.38	% (31190)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/4Mi)
0.12/0.38	% (31192)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/2Mi)
0.12/0.38	% (31191)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/27Mi)
0.12/0.38	% (31193)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/2Mi)
0.12/0.38	% (31189)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/183Mi)
0.12/0.38	% (31194)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/275Mi)
0.12/0.38	% (31195)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_31082 for (2399ds/18Mi)
0.12/0.38	% (31194)First to succeed.
0.12/0.38	% (31193)Instruction limit reached!
0.12/0.38	% (31193)------------------------------
0.12/0.38	% (31193)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.12/0.38	% (31193)Termination reason: Unknown
0.12/0.38	% (31193)Termination phase: Saturation
0.12/0.38	
0.12/0.38	% (31193)Memory used [KB]: 5500
0.12/0.38	% (31193)Time elapsed: 0.004 s
0.12/0.38	% (31193)Instructions burned: 2 (million)
0.12/0.38	% (31193)------------------------------
0.12/0.38	% (31193)------------------------------
0.12/0.38	% (31192)Also succeeded, but the first one will report.
0.12/0.38	% (31191)Also succeeded, but the first one will report.
0.12/0.38	% (31194)Refutation found. Thanks to Tanya!
0.12/0.38	% SZS status Theorem for E---3.1_31082
0.12/0.38	% SZS output start Proof for E---3.1_31082
0.12/0.38	thf(func_def_0, type, f: $i > $i).
0.12/0.38	thf(func_def_4, type, sK0: $i > $i).
0.12/0.38	thf(func_def_5, type, sK1: ($i > $i) > $i).
0.12/0.38	thf(func_def_7, type, ph3: !>[X0: $tType]:(X0)).
0.12/0.38	thf(f14,plain,(
0.12/0.38	  $false),
0.12/0.38	  inference(trivial_inequality_removal,[],[f13])).
0.12/0.38	thf(f13,plain,(
0.12/0.38	  ((sK1 @ sK0) != (sK1 @ sK0))),
0.12/0.38	  inference(superposition,[],[f12,f11])).
0.12/0.38	thf(f11,plain,(
0.12/0.38	  ( ! [X0 : $i] : (((f @ (sK0 @ X0)) = X0)) )),
0.12/0.38	  inference(cnf_transformation,[],[f8])).
0.12/0.38	thf(f8,plain,(
0.12/0.38	  ! [X0] : ((f @ (sK0 @ X0)) = X0)),
0.12/0.38	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f7])).
0.12/0.38	thf(f7,plain,(
0.12/0.38	  ! [X0] : (? [X1] : ((f @ X1) = X0) => ((f @ (sK0 @ X0)) = X0))),
0.12/0.38	  introduced(choice_axiom,[])).
0.12/0.38	thf(f5,plain,(
0.12/0.38	  ! [X0] : ? [X1] : ((f @ X1) = X0)),
0.12/0.38	  inference(rectify,[],[f3])).
0.12/0.38	thf(f3,axiom,(
0.12/0.38	  ! [X2] : ? [X1] : ((f @ X1) = X2)),
0.12/0.38	  file('/export/starexec/sandbox/tmp/tmp.GNhDOeYHBy/E---3.1_31082.p',fsurj)).
0.12/0.38	thf(f12,plain,(
0.12/0.38	  ( ! [X0 : $i > $i] : (((f @ (X0 @ (sK1 @ X0))) != (sK1 @ X0))) )),
0.12/0.38	  inference(cnf_transformation,[],[f10])).
0.12/0.38	thf(f10,plain,(
0.12/0.38	  ! [X0 : $i > $i] : ((f @ (X0 @ (sK1 @ X0))) != (sK1 @ X0))),
0.12/0.38	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f6,f9])).
0.12/0.38	thf(f9,plain,(
0.12/0.38	  ! [X0 : $i > $i] : (? [X1] : ((f @ (X0 @ X1)) != X1) => ((f @ (X0 @ (sK1 @ X0))) != (sK1 @ X0)))),
0.12/0.38	  introduced(choice_axiom,[])).
0.12/0.38	thf(f6,plain,(
0.12/0.38	  ! [X0 : $i > $i] : ? [X1] : ((f @ (X0 @ X1)) != X1)),
0.12/0.38	  inference(ennf_transformation,[],[f2])).
0.12/0.38	thf(f2,negated_conjecture,(
0.12/0.38	  ~? [X0 : $i > $i] : ! [X1] : ((f @ (X0 @ X1)) = X1)),
0.12/0.38	  inference(negated_conjecture,[],[f1])).
0.12/0.38	thf(f1,conjecture,(
0.12/0.38	  ? [X0 : $i > $i] : ! [X1] : ((f @ (X0 @ X1)) = X1)),
0.12/0.38	  file('/export/starexec/sandbox/tmp/tmp.GNhDOeYHBy/E---3.1_31082.p',invexists)).
0.12/0.38	% SZS output end Proof for E---3.1_31082
0.12/0.38	% (31194)------------------------------
0.12/0.38	% (31194)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.12/0.38	% (31194)Termination reason: Refutation
0.12/0.38	
0.12/0.38	% (31194)Memory used [KB]: 5500
0.12/0.38	% (31194)Time elapsed: 0.004 s
0.12/0.38	% (31194)Instructions burned: 1 (million)
0.12/0.38	% (31194)------------------------------
0.12/0.38	% (31194)------------------------------
0.12/0.38	% (31188)Success in time 0.008 s
0.12/0.38	EOF